On the longest path algorithm for reconstructing trees from distance matricesREYZIN, Lev; SRIVASTAVA, Nikhil.Information processing letters. 2007, Vol 101, Num 3, pp 98-100, issn 0020-0190, 3 p.Article

Graph traversal and graph transformationHOLDSWORTH, Jason J.Theoretical computer science. 2004, Vol 321, Num 2-3, pp 215-231, issn 0304-3975, 17 p.Article

Dominations in trapezoid graphsLIANG, Y. D.Information processing letters. 1994, Vol 52, Num 6, pp 309-315, issn 0020-0190Article

A processor efficient MIS algorithm on random graphsYANG, S. B; DHALL, S. K; LAKSHMIVARAHAN, S et al.Information processing letters. 1994, Vol 49, Num 3, pp 157-163, issn 0020-0190Article

Computing bounded-degree phylogenetic roots of disconnected graphsCHEN, Zhi-Zhong; TSUKIJI, Tatsuie.Journal of algorithms (Print). 2006, Vol 59, Num 2, pp 125-148, issn 0196-6774, 24 p.Article

Bisecting a 4-connected graph with three resource setsISHII, Toshimasa; IWATA, Kengo; NAGAMOCHI, Hiroshi et al.Discrete applied mathematics. 2007, Vol 155, Num 11, pp 1441-1450, issn 0166-218X, 10 p.Article

On the complexity of reconfiguration problemsITO, Takehiro; DEMAINE, Erik D; HARVEY, Nicholas J. A et al.Theoretical computer science. 2011, Vol 412, Num 12-14, pp 1054-1065, issn 0304-3975, 12 p.Article

Post-processing hierarchical community structures: Quality improvements and multi-scale viewPONS, Pascal; LATAPY, Matthieu.Theoretical computer science. 2011, Vol 412, Num 8-10, pp 892-900, issn 0304-3975, 9 p.Article

Minimal cutwidth linear arrangements of abelian Cayley graphsBEREND, Daniel; KORACH, Ephraim; LIPETS, Vladimir et al.Discrete mathematics. 2008, Vol 308, Num 20, pp 4670-4695, issn 0012-365X, 26 p.Article

On the graph turnpike problemFEDER, Tomas; MOTWANI, Rajeev.Information processing letters. 2009, Vol 109, Num 14, pp 774-776, issn 0020-0190, 3 p.Article

A better list heuristic for vertex coverDELBOT, Francois; LAFOREST, Christian.Information processing letters. 2008, Vol 107, Num 3-4, pp 125-127, issn 0020-0190, 3 p.Article

Optimal register allocation for SSA-form programs in polynomial timeHACK, Sebastian; GOOS, Gerhard.Information processing letters. 2006, Vol 98, Num 4, pp 150-155, issn 0020-0190, 6 p.Article

The Pair Completion algorithm for the Homogeneous Set Sandwich ProblemBOMSTEIN, Claudson; DE FIGUEIREDO, Celina M. H; DE SA, Vinicius G. P et al.Information processing letters. 2006, Vol 98, Num 3, pp 87-91, issn 0020-0190, 5 p.Article

The diameter of Hanoi graphsBEREND, Daniel; SAPIR, Amir.Information processing letters. 2006, Vol 98, Num 2, pp 79-85, issn 0020-0190, 7 p.Article

Approximating k-spanner problems for k > 2ELKIN, Michael; PELEG, David.Theoretical computer science. 2005, Vol 337, Num 1-3, pp 249-277, issn 0304-3975, 29 p.Article

Recognizing triangulated Cartesian graph productsAFZAL, Shehzad; BRAND, Clemens.Discrete mathematics. 2012, Vol 312, Num 1, pp 188-193, issn 0012-365X, 6 p.Article

Parameterized power domination complexityKNEIS, Joachim; MÖLLE, Daniel; RICHTER, Stefan et al.Information processing letters. 2006, Vol 98, Num 4, pp 145-149, issn 0020-0190, 5 p.Article

Safe separators for treewidthBODLAENDER, Hans L; KOSTER, Arie M. C. A.Discrete mathematics. 2006, Vol 306, Num 3, pp 337-350, issn 0012-365X, 14 p.Article

The complexity of some acyclic improper colouringsBOROWIECKI, Mieczysław; JESSE-JOZEFCZYK, Katarzyna; SIDOROWICZ, Elżbieta et al.Discrete mathematics. 2011, Vol 311, Num 8-9, pp 732-737, issn 0012-365X, 6 p.Article

An algorithm for partitioning trees augmented with sibling edgesBORDAWEKAR, Rajesh; SHMUELI, Oded.Information processing letters. 2008, Vol 108, Num 3, pp 136-142, issn 0020-0190, 7 p.Article

A simple algorithm for edge-coloring bipartite multigraphsALON, Noga.Information processing letters. 2003, Vol 85, Num 6, pp 301-302, issn 0020-0190, 2 p.Article

Random walks on weighted graphs and applications to on-line algorithmsCOPPERSMITH, D; DOYLE, P; PRABHAKAR RAGHAVAN et al.Journal of the Association for Computing Machinery. 1993, Vol 40, Num 3, pp 421-453, issn 0004-5411Article

A remark on algorithm 643: FEXACT: An algorithm for performing fisher's exact test in r × c contigency tablesCLARKSON, D. B; FAN, Y; JOE, H et al.ACM transactions on mathematical software. 1993, Vol 19, Num 4, pp 484-488, issn 0098-3500Article

Computing the average distance of an interval graphDANKELMANN, P.Information processing letters. 1993, Vol 48, Num 6, pp 311-314, issn 0020-0190Article

Diamond-free circle graphs are Helly circleDALIGAULT, Jean; GONCALVES, Daniel; RAO, Michaël et al.Discrete mathematics. 2010, Vol 310, Num 4, pp 845-849, issn 0012-365X, 5 p.Article